A Continuous Approximation Model for the Vehicle Routing Problem for Emissions Minimization at the Strategic Level

نویسنده

  • Meead Saberi
چکیده

This paper presents a continuous approximation model for the Vehicle Routing Problem for Emissions Minimization (EVRP) and demonstrates the model’s applicability and usefulness with numerical studies based on implementations of the Solomon test instances. The EVRP is a variant of the Time Dependent Vehicle Routing Problem (TDVRP) in which minimizing emissions is an additional objective of the model. The continuous approximation model presented in this paper will facilitate strategic planning of one-to-many distribution systems and evaluate the effects of emissions costs. Furthermore, results from the continuous model can provide guidelines for constructing solutions for the discrete EVRP. Furthermore, results from a sensitivity analysis indicated that the optimal number of dispatches during the peak period is smaller than the optimal number of dispatches during the off-peak period when considering the temporal effects of congestion. Results revealed that the potential cost savings due to incorporating emissions in distribution problems are considerable. Incorporating emissions costs in distribution problems will contribute toward having more environmentally sustainable distribution systems. The proposed continuous approximation model can be extended for other specific conditions, e.g. when considering pipeline inventory, storage restrictions, different customers, random demand, discriminating strategies, etc.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new Bi-objective model for a Two-echelon Capacitated Vehicle Routing Problem for Perishable Products with the Environmental Factor

In multi-echelon distribution strategy freight is delivered to customers via intermediate depots. Rather than using direct shipments, this strategy is an increasingly popular one in urban logistics. This is primarily to alleviate the environmental (e.g., energy usage and congestion) and social (e.g., traffic-related air pollution, accidents and noise) consequences of logistics operations. This ...

متن کامل

A Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows

This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...

متن کامل

A multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

متن کامل

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015